منابع مشابه
Distinguishability of Locally Finite Trees
The distinguishing number ∆(X) of a graph X is the least positive integer n for which there exists a function f : V (X) → {0, 1, 2, · · · , n−1} such that no nonidentity element of Aut(X) fixes (setwise) every inverse image f−1(k), k ∈ {0, 1, 2, · · · , n − 1}. All infinite, locally finite trees without pendant vertices are shown to be 2distinguishable. A proof is indicated that extends 2-disti...
متن کاملThere are uncountably many topological types of locally finite trees
Consider two locally finite rooted trees as equivalent if each of them is a topological minor of the other, with an embedding preserving the tree-order. Answering a question of van der Holst, we prove that there are uncountably many equivalence classes.
متن کاملAlgebraic Approach to Locally Finite Trees with One End
Let T be an infinite locally finite tree. We say that T has exactly one end, if in T any two one-way infinite paths have a common rest (infinite subpath). The paper describes the structure of such trees and tries to formalize it by algebraic means, namely by means of acyclic monounary algebras or tree semilattices. In these algebraic structures the homomorpisms and direct products are considere...
متن کاملA Counterexample to the Reconstruction Conjecture for Locally Finite Trees
Two graphs G and H are hypomorphic if there exists a bijection φ : V (G)→ V (H) such that G− v ∼= H − φ(v) for each v ∈ V (G). A graph G is reconstructible if H ∼= G for all H hypomorphic to G. It is well known that not all infinite graphs are reconstructible. However, the Harary-Schwenk-Scott Conjecture from 1972 suggests that all locally finite trees are reconstructible. In this paper, we con...
متن کاملLocally finite basic classical simple Lie superalgebras
In this work, we study direct limits of finite dimensional basic classical simple Lie superalgebras and obtain the conjugacy classes of Cartan subalgebras under the group of automorphisms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2007
ISSN: 1077-8926
DOI: 10.37236/947